- pseudo-Boolean
- псевдобулев
English-Russian dictionary of computer science and programming. 2013.
pseudo-Boolean
Смотреть что такое "pseudo-Boolean" в других словарях:
Peter Hammer — Peter L. Hammer (December 23, 1936 December 27, 2006) was an American mathematician native to Romania. He contributed to the fields of operations research and applied discrete mathematics through the study of pseudo Boolean functions and their… … Wikipedia
Peter Hammer — Peter L. Hammer (23 décembre 1936 à Timisoara, Roumanie 27 décembre 2006 à Princeton, New Jersey) est un mathématicien américain d origine roumaine. Ses travaux s inscrivent dans le champ de la recherche opérationnelle et des mathématiques… … Wikipédia en Français
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
Maximum satisfiability problem — In computational complexity theory, the Maximum Satisfiability problem (MAX SAT) is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by some assignment. It is an FNP generalization of SAT … Wikipedia
Minimum cut — In graph theory, a minimum cut of a graph is a cut whose cutset has the smallest number of elements (unweighted case) or smallest sum of weights possible. Several algorithms exist to find minimum cuts. For a graph G = (V, E), the problem can be… … Wikipedia
Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… … Wikipedia
logic, history of — Introduction the history of the discipline from its origins among the ancient Greeks to the present time. Origins of logic in the West Precursors of ancient logic There was a medieval tradition according to which the Greek philosopher … Universalium
Interior algebra — In abstract algebra, an interior algebra is a certain type of algebraic structure that encodes the idea of the topological interior of a set. Interior algebras are to topology and the modal logic S4 what Boolean algebras are to set theory and… … Wikipedia
Smalltalk — This article is about the programming language. For other uses, see Small talk (disambiguation). Smalltalk Smalltalk 80: The Language and its Implementation, a.k.a. the Blue book , a seminal book on the language Paradigm(s) object oriented… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
Charles Sanders Peirce — B … Wikipedia
